Automated prediction system of household energy consumption in cities using web crawler and optimized artificial intelligence

The supply of electrical energy is critical to convenient and comfortable living. However, people consume a large amount of energy, contributing to an energy crisis and global warming, and damaging some ecological cycles. Residential electricity consumption has greater elasticity than industrial and business consumption; it therefore has high energy-saving potential. This work establishes an automated platform, which provides information about residential electricity consumption in each city in Taiwan. Machine learning was used to forecast future residential electricity demand. A nature-inspired optimization method was applied to enhance the accuracy of the best machine learner, yielding an even better hybrid ensemble model. Performance measures indicate that the resulting model is accurate and provides effective information for reference. An automatic web-based system based on the model was combined with a web crawler and scheduled to run automatically to provide information on monthly residential electricity consumption in each county and city. By providing energy consumption information across the country, power providers and government can discuss policy and set different goals for energy use. The results of this study can facilitate the early implementation of energy-saving and carbon emission-reducing in cities and aid utility companies in establishing energy conservation guidelines.     

Oil Demand and Stocks

Current data of world oil demand. This includes international bunkers and refinery fuel. Updated on a monthly basis. Current data of oil demand from counties such as Canada, the United States of America, Japan, OECD Europe, Belgium, France, Germany, Italy, Netherlands, Spain, Sweden, the United Kingdom, Australia, Mexico, Republic of Korea, and Turkey. Updated on a monthly basis. Current data for crude oil and refined product stocks in Canada, Chile, Mexico, the United States (Western Hemisphere), France, Germany, Italy, Netherlands, Spain, the United Kingdom and Other Europe (Europe), Japan, Republic of Korea, Other Pacific (Asia‐Pacific), and Total OECD (Table 12.1) Current data for refined product stocks in the OECD Western Hemisphere, OECD Europe, OECD Asia‐Pacific and Total OECD. Products include gasoline, diesel and gasoil, and heavy fuel oil. Updated on a monthly basis (Table 12.2).     

High performance H2 sensor based on rGO-wrapped SnO2–Pd porous hollow spheres

Hydrogen (H₂) sensors based on metal oxide semiconductors (MOS) are promising for many applications such as a rocket propellant, industrial gas and the safety of storage. However, poor selectivity at low analyte concentrations, and independent response on high humidity limit the practical applications. Herein, we designed rGO-wrapped SnO₂–Pd porous hollow spheres composite (SnO₂–Pd@rGO) for high performance H₂ sensor. The porous hollow structure was from the carbon sphere template. The rGO wrapping was via self-assembly of GO on SnO₂-based spheres with subsequent thermal reduction in H₂ ambient. This sensor exhibited excellently selective H₂ sensing performances at 390 °C, linear response over a broad concentration range (0.1–1000 ppm) with recovery time of only 3 s, a high response of ～8 to 0.1 ppm H₂ in a minute, and acceptable stability under high humidity conditions (e. g. 80%). The calculated detection limit of 16.5 ppb opened up the possibility of trace H₂ monitoring. Furthermore, this sensor demonstrated certain response to H₂ at the minimum concentration of 50 ppm at 130 °C. These performances mainly benefited from the special hollow porous structure with abundant heterojunctions, the catalysis of the doped-PdO_x, the relative hydrophobic surface from rGO, and the deoxygenation after H₂ reduction.     

基于混合蚁群算法的异质车队低碳VRP研究

针对货运车辆在配送调度过程中产生大量碳排放的问题，建立模型将多种影响碳排放量的因素协同优化。模型中考虑了不同载重量的异质车队，两个节点之间有多条道路的柔性路径，以及车辆重量随卸货而减少的动态负载等因素，以碳排放量、行驶时间和行驶路程为优化目标，并加入了节点需求时间窗、根据速度变化划分路段、交接和卸货时间的约束。提出了一种混合蚁群算法，利用蚁群算法信息素强度更新方式保持群体记忆性，利用粒子群算法的快速收敛特性增加计算效率。通过随机数值算例的仿真优化与对比分析，验证了算法和模型的有效性。     

Mathematical formulation and heuristic algorithms for optimisation of auto-part milk-run logistics network considering forward and reverse flow of pallets

The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy.     

Airline planning and scheduling: Models and solution methodologies

The airline industry is a representative industry with high cost and low profitability. Therefore, airlines should carefully plan their schedules to ensure that overall profit is maximized. We review the literature on airline planning and scheduling and focus on mathematical formulations and solution methodologies. Our research framework is anchored on three major problems in the airline scheduling, namely, fleet assignment, aircraft routing, and crew scheduling. General formulation, widely used solution approaches, and important extensions are presented for each problem and integrated problems. We conclude the review by identifying promising areas for further research.     

臭氧氧化-循环喷淋法处理钨钼选矿废水

采用臭氧氧化-循环喷淋法去除钨钼选矿废水中COD,研究了pH值、臭氧流量、循环频率对COD去除效果的影响。结果表明: 废水COD去除率随pH值、臭氧流量、循环频率增大而增加,在pH值为10、臭氧流量3.0 L/min、循环频率4.0次/min条件下,氧化120 min后废水COD含量由131 mg/L降至11.5 mg/L,COD去除率达91.2%,满足《污水综合排放标准》(GB 8978-1996)一级标准。与O₂、NaClO处理废水COD的对比试验结果表明,循环喷淋法结合O₃表现出较好的COD去除效果。     

Ex post demand information sharing between differentiated suppliers and a common retailer

We consider ex post demand information sharing in a two-echelon supply chain in which two suppliers sell differentiated products through a common retailer. We model three scenarios of information sharing to characterise the conditions under which information sharing may benefit or hurt different players: (1) no supplier is informed; (2) only one supplier is informed; and (3) both suppliers are informed. We find that the retailer may voluntarily share the low demand information when the product differentiation and demand magnitude satisfy certain conditions. In contrast, the retailer has no incentive to share the high demand information, even though this information benefits the suppliers. To achieve information sharing, we propose a side payment mechanism, which allows benefitted players to subsidise hurtful players. Finally, we extend our model by considering a situation where the suppliers have limited capacity and may invest to ramp up production capacity to satisfy a high demand.     

HSDN‐GRA: A hybrid software‐defined networking‐based geographic routing protocol with multi‐agent approach

We propose in this paper a Hybrid Software‐Defined Networking‐based Geographical Routing Protocol (HSDN‐GRA) with a clustering approach. It takes into account three different criteria to select the best relay to send data: (1) the contact duration between vehicles, (2) the available load of each vehicle, (3) and the log of encountered communication errors embedded in each cluster head. The multi‐criteria strategy allows the selection of the most reliable vehicles by avoiding communication problems and ensuring connection availability. Once the hybrid control plane has found out the next eligible neighbor, the data plane will be in charge of dividing and sending data. To validate our approach, HSDN‐GRA has been modeled and implemented in JADE, a multi‐agent platform, to be compared to other multi‐agent based protocols. Simulation results show that HSDN‐GRA achieves good performance with respect to the average routing overhead, the packet drop rate, and the throughput.